Hybrid PSO-tabu search for constrained non-linear optimization problems
نویسندگان
چکیده
In this paper we present a new method to solve a constrained non-linear problem. The method is based on hybridizing the Particle Swarm Optimization and tabu-search meta-heuristics (PSOTS). Tow tabu-lists are used within the PSO algorithm: the first one aims to diversify the best solutions obtained by particles when the second bans temporarily solutions non-respecting the constraints. The obtained meta-heuristic is validated on real thermal problem called T-junction problem. It consists on optimizing the thermal management of the system and minimizing its over heating by improving its design and the flow distribution. Our results are compared with Genetic algorithm.
منابع مشابه
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملParticle Swarm Optimization – Tabu Search Approach to Constrained Engineering Optimization Problems
Abstract: Constraint handling is one of the most difficult parts encountered in practical engineering design optimizations. Different kinds of methods were proposed for handling constraints namely, genetic algorithm, self-adaptive penalty approach and other evolutionary algorithms. Particle Swarm Optimization (PSO) efficiently solved most nonlinear optimization problems with inequity constraint...
متن کاملHybrid of Particle Swarm Optimization, Simulated Annealing and Tabu Search for the Reconstruction of Two-dimensional Targets from Laboratory-controlled Data
Recently, the use of the particle swarm optimization (PSO) technique for the reconstruction of microwave images has received increasing interest from the optimization community due to its simplicity in implementation and its inexpensive computational overhead. However, the basic PSO algorithm is easily trapping into local minimum and may lead to the premature convergence. When a local optimal s...
متن کاملRecent Developments of Computational Intelligence for Resource Constrained Project Scheduling Problems: A Taxonomy and Review
This article presents a broad overview of applications of Computational Intelligence (CI) paradigms in resource constrained project scheduling problems (RCPSP) including Fuzzy system (FS), Artificial Neural Networks (ANN), Particle Swarm Optimization (PSO), Tabu Search (TS), Genetic Algorithms (GA), Simulated Annealing (SA) and other metaheuristics techniques. Recent developments of computation...
متن کاملCONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM
A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...
متن کامل